package org.example.myleet.p598;

public class Solution {
    public int maxCount(int m, int n, int[][] ops) {
        int minM = m, minN = n;
        for (int[] op : ops) {
            //只要看成是每个op都缩小了m和n就行了，取最小都m和n相乘就是结果
            minM = Math.min(minM, op[0]);
            minN = Math.min(minN, op[1]);
        }
        return minM * minN;
    }
}
